Add to ORKGIn this paper we prove the semi-circular law for the eigenvalues of regular random graph Gn,d in the case d→∞, complementing a previous result of McKay for fixed d. We also obtain a upper bound on the infinity norm of eigenvectors of Erdős-Rényi random graph G(n, p), answering a question raised by Dekel-Lee-Linial
Let $M_n$ be a random Hermitian (or symmetric) matrix whose upper diagonal and diagonal entries are ...
AMS Subject Classication: 05C80 Abstract. Many graphs arising in various information networks exhibi...
International audienceNetwork geometries are typically characterized by having a finite spectral dim...
In this paper we prove the semi-circular law for the eigenvalues of regular random graph Gn,d in the...
Abstract. We examine the empirical distribution of the eigenvalues and the eigenvectors of adjacency...
this paper we study eigenvalues of random graphs. The random graph G(n, p)isthe discrete probabilit...
We consider the statistics of the extreme eigenvalues of sparse random matrices, a class of random m...
This work is concerned with an asymptotical distribution of eigenvalues of sparse random matrices. I...
We consider spectral properties and the edge universality of sparse random matrices, the class of ra...
We establish bounds on the spectral radii for a large class of sparse random matrices, which include...
We establish bounds on the spectral radii for a large class of sparse random matrices, which include...
We establish bounds on the spectral radii for a large class of sparse random matrices, which include...
AMS Subject Classification: 05C80 Abstract. Many graphs arising in various information networks exhi...
We consider a sparse random subraph of the $n$-cube where each edge appears independently w...
We consider a sparse random subraph of the $n$-cube where each edge appears independently w...
Let $M_n$ be a random Hermitian (or symmetric) matrix whose upper diagonal and diagonal entries are ...
AMS Subject Classication: 05C80 Abstract. Many graphs arising in various information networks exhibi...
International audienceNetwork geometries are typically characterized by having a finite spectral dim...
In this paper we prove the semi-circular law for the eigenvalues of regular random graph Gn,d in the...
Abstract. We examine the empirical distribution of the eigenvalues and the eigenvectors of adjacency...
this paper we study eigenvalues of random graphs. The random graph G(n, p)isthe discrete probabilit...
We consider the statistics of the extreme eigenvalues of sparse random matrices, a class of random m...
This work is concerned with an asymptotical distribution of eigenvalues of sparse random matrices. I...
We consider spectral properties and the edge universality of sparse random matrices, the class of ra...
We establish bounds on the spectral radii for a large class of sparse random matrices, which include...
We establish bounds on the spectral radii for a large class of sparse random matrices, which include...
We establish bounds on the spectral radii for a large class of sparse random matrices, which include...
AMS Subject Classification: 05C80 Abstract. Many graphs arising in various information networks exhi...
We consider a sparse random subraph of the $n$-cube where each edge appears independently w...
We consider a sparse random subraph of the $n$-cube where each edge appears independently w...
Let $M_n$ be a random Hermitian (or symmetric) matrix whose upper diagonal and diagonal entries are ...
AMS Subject Classication: 05C80 Abstract. Many graphs arising in various information networks exhibi...
International audienceNetwork geometries are typically characterized by having a finite spectral dim...